EARL: Joint Entity and Relation Linking for Question Answering over Knowledge Graphs

نویسندگان

  • Mohnish Dubey
  • Debayan Banerjee
  • Debanjan Chaudhuri
  • Jens Lehmann
چکیده

In order to answer natural language questions over knowledge graphs, most processing pipelines involve entity and relation linking. Traditionally, entity linking and relation linking have been performed either as dependent sequential tasks or independent parallel tasks. In this paper, we propose a framework, called EARL, which performs entity linking and relation linking as a joint single task. EARL is modelled on a optimised variation of Generalised Travelling Salesperson Problem. The system determines the best semantic connection between all keywords of the question by referring to the knowledge graph. This is achieved by exploiting the connection density between entity candidates and relation candidates. We have empirically evaluated the framework on a dataset with 3000 complex questions. Our system surpasses state-of-the-art scores for entity linking task by reporting an accuracy of 0.67 against 0.40 from the next best entity linker.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong Baselines for Simple Question Answering over Knowledge Graphs with and without Neural Networks

We examine the problem of question answering over knowledge graphs, focusing on simple questions that can be answered by the lookup of a single fact. Adopting a straightforward decomposition of the problem into entity detection, entity linking, relation prediction, and evidence combination, we explore simple yet strong baselines. On the SIMPLEQUESTIONS dataset, we find that baseline LSTMs and G...

متن کامل

The Limited Effectiveness of Neural Networks for Simple Question Answering on Knowledge Graphs

Simple factoid question answering (QA) is a task, where the questions can be answered by looking up a single fact in the knowledge base (KB). However, this QA task is difficult, since retrieving a single supporting fact involves searching many alternatives given a query expressed in natural language. We use a retrieval-based approach to QA. We decompose the problem into four sub-problems: entit...

متن کامل

Learning a Cross-Lingual Semantic Representation of Relations Expressed in Text

Learning cross-lingual semantic representations of relations from textual data is useful for tasks like cross-lingual information retrieval and question answering. So far, research has been mainly focused on cross-lingual entity linking, which is confined to linking between phrases in a text document and their corresponding entities in a knowledge base but cannot link to relations. In this pape...

متن کامل

Probabilistic Inference for Cold Start Knowledge Base Population with Prior World Knowledge

Building knowledge bases (KB) automatically from text corpora is crucial for many applications such as question answering and web search. The problem is very challenging and has been divided into sub-problems such as mention and named entity recognition, entity linking and relation extraction. However, combining these components has shown to be under-constrained and often produces KBs with supe...

متن کامل

Improving the Precision of RDF Question/Answering Systems: A Why Not Approach

Given a natural language question qNL over an RDF dataset D, an RDF Question/Answering (Q/A) system first translates qNL into a SPARQL query graph Q and then evaluates Q over the underlying knowledge graph to figure out the answers Q(D). However, due to the challenge of understanding natural language questions and the complexity of linking phrases with specific RDF items (e.g., entities and pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1801.03825  شماره 

صفحات  -

تاریخ انتشار 2018